Outerplanar graph

Results: 57



#Item
41Recent Approaches to Pattern Discovery and Ranking with Graphs Prof. Dr. Stefan Wrobel Fraunhofer IAIS and University of Bonn Joint work with Mario Boley, Dr. Thomas Gärtner, Dr. Tamas Horváth, Dr. Axel Poigné, and Sh

Recent Approaches to Pattern Discovery and Ranking with Graphs Prof. Dr. Stefan Wrobel Fraunhofer IAIS and University of Bonn Joint work with Mario Boley, Dr. Thomas Gärtner, Dr. Tamas Horváth, Dr. Axel Poigné, and Sh

Add to Reading List

Source URL: www.iais.fraunhofer.de

Language: English - Date: 2007-11-08 02:53:21
42MDS Statusworkshop 2013 The Methods for Discrete Structures anual statusworkshop will start on the afternoon of Thursday, January 24th, 2013 and it will end at noon of Saturday, January 26th, 2013. The seminar will take

MDS Statusworkshop 2013 The Methods for Discrete Structures anual statusworkshop will start on the afternoon of Thursday, January 24th, 2013 and it will end at noon of Saturday, January 26th, 2013. The seminar will take

Add to Reading List

Source URL: www3.math.tu-berlin.de

Language: English
431  Universit´ e de Bordeaux 1 Sciences et Technologies

1 Universit´ e de Bordeaux 1 Sciences et Technologies

Add to Reading List

Source URL: www.algant.eu

Language: English - Date: 2010-10-13 22:17:14
44Ch4 Graph theory and algorithms This chapter presents a few problems, results and algorithms from the vast discipline of Graph theory. All of these topics can be found in many text books on graphs. Notation: G = (V, E),

Ch4 Graph theory and algorithms This chapter presents a few problems, results and algorithms from the vast discipline of Graph theory. All of these topics can be found in many text books on graphs. Notation: G = (V, E),

Add to Reading List

Source URL: www.jn.inf.ethz.ch

Language: English - Date: 2005-03-18 05:24:46
45Planar Graph Growth Constants Steven Finch August 25, 2004 A graph of order n consists of a set of n vertices (points) together with a set of edges (unordered pairs of distinct points). Note that loops and multiple paral

Planar Graph Growth Constants Steven Finch August 25, 2004 A graph of order n consists of a set of n vertices (points) together with a set of edges (unordered pairs of distinct points). Note that loops and multiple paral

Add to Reading List

Source URL: www.people.fas.harvard.edu

Language: English - Date: 2006-04-26 14:46:20
46Planar Separators and the Euclidean Norm Hillel Gazit*

Planar Separators and the Euclidean Norm Hillel Gazit*

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2007-11-16 18:13:27
47Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs Cyril Gavoille and Arnaud Labourel

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs Cyril Gavoille and Arnaud Labourel

Add to Reading List

Source URL: dept-info.labri.fr

Language: English - Date: 2007-08-07 09:06:34
48(C[removed]Society for Industrial and Applied Mathematics  SIAM J. Disc. MATH.

(C[removed]Society for Industrial and Applied Mathematics SIAM J. Disc. MATH.

Add to Reading List

Source URL: www.math.ucsd.edu

Language: English - Date: 2005-02-05 02:31:59
49The Eighth International Symposium on Operations Research and Its Applications (ISORA’09) Zhangjiajie, China, September 20–22, 2009 Copyright © 2009 ORSC & APORC, pp. 6–14

The Eighth International Symposium on Operations Research and Its Applications (ISORA’09) Zhangjiajie, China, September 20–22, 2009 Copyright © 2009 ORSC & APORC, pp. 6–14

Add to Reading List

Source URL: www.aporc.org

Language: English - Date: 2009-09-27 05:27:27
50Felsner[removed]dvi

Felsner[removed]dvi

Add to Reading List

Source URL: jgaa.info

Language: English - Date: 2004-07-06 02:42:36